Optimal Positioning in low-Dimensional control Spaces using Convex Optimization
نویسندگان
چکیده
A music analysis and control system for use in live performance is presented and demonstrated. Musical features, such as harmony, rhythmic patterning, or melodic structure, are extracted and automatically placed at appropriate locations in a control space. The control space is of low dimensionality, usually only two dimensions, wherein perceptual dissimilarity is represented as distance. The system can be viewed as a listening assistant that aids a performing computer musician with usable information about the evolving musical context so that the material under control can be adjusted to respond in interesting ways to that context. The method developed to position the points is based on a semidefinite programming relaxation of a nonconvex positioning problem and is both novel and elegant. Another novel feature of our work is an interprocess communication implementation that provides for two-way traffic between Max/MSP and MATLAB in realtime. We demonstrate the system with a harmony space and a melodic process space. The method is robust, rapid, and not plagued by problems with local minima. This successful use of convex optimization suggests that semidefinite programming may have broad application in the computer music field.
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملConvex Receding Horizon Control in Non-Gaussian Belief Space
One of the main challenges in solving partially observable control problems is planning in high-dimensional belief spaces. Essentially, it is necessary to plan in the parameter space of all relevant probability distributions over the state space. The literature has explored different planning technologies including trajectory optimization [8, 6] and roadmap methods [12, 4]. Unfortunately, these...
متن کاملFrom Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs in which the performance of the approximation is quantified explicitly. To this end, we adopt the recent developments in two areas of random...
متن کاملAnalysis of Microstructures and Phase Transition Phenomena in One-Dimensional, Non-Linear Elasticity by Convex Optimization
We propose a general method to determine the theoretical microstructure in one dimensional elastic bars whose internal deformation energy is given by non-convex polynomials. We use non-convex variational principles and Young measure theory to describe the optimal energetic configuration of the body. By using convex analysis and classical characterizations of algebraic moments, we can formulate ...
متن کاملA Double Smoothing Technique for Constrained Convex Optimization Problems and Applications to Optimal Control
In this paper, we propose an efficient approach for solving a class of convex optimization problems in Hilbert spaces. Our feasible region is a (possibly infinite-dimensional) simple convex set, i.e. we assume that projections on this set are computationally easy to compute. The problem we consider is the minimization of a convex function over this region under the additional constraint Au ∈ T ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005